Maximal Existential and Universal Width
نویسندگان
چکیده
The tree width of an alternating finite automaton (AFA) measures the parallelism in all computations AFA on a given input. maximal existential (respectively, universal) A string w number choices parallel universal branches) one computation w. We give polynomial time algorithms deciding finiteness AFA’s and width. Also we algorithm that for with decides whether or not is finite. Finiteness decidable general case but uses exponential time. Additionally, establish necessary sufficient conditions to have growth rate, as well
منابع مشابه
Universal (and Existential) Nulls
Incomplete Information research is quite mature when it comes to so called existential nulls, where an existential null is a value stored in the database, representing an unknown object. For some reason universal nulls, that is, values representing all possible objects, have received almost no attention. We remedy the situation in this paper, by showing that a suitable finite representation mec...
متن کاملExistential and Universal Anchoring 1 Existential and Universal Anchoring : A Case Study
Anchoring constraints were originally proposed for explaining the special faithfulness to edges, both in the domain of Input-Output correspondence (e.g. Benua 1998) and Base-Reduplicant correspondence (e.g. Hendricks 1998). In Optimality Theory framework (Prince & Smolensky 1993), this paper proposes two sets of anchoring constraints, Existential and Universal ANCHORING for edges and head, requ...
متن کاملOn the Universal and Existential Fragments of the µ-Calculus
One source of complexity in the μ-calculus is its ability to specify an unbounded number of switches between universal (AX) and existential (EX) branching modes. We therefore study the problems of satisfiability, validity, model checking, and implication for the universal and existential fragments of the μ-calculus, in which only one branching mode is allowed. The universal fragment is rich eno...
متن کاملThe Complexity of Width Minimization for Existential Positive Queries
Existential positive queries are logical sentences built from conjunction, disjunction, and existential quantification, and are also known as select-project-join-union queries in database theory, where they are recognized as a basic and fundamental class of queries. It is known that the number of variables needed to express an existential positive query is the crucial parameter determining the ...
متن کاملMaximal width learning of binary functions
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generalization error bounds. We derive error bounds that depend on the sample width (a notion similar to that of sample margin for real-valued functions). This motivates learning algorithms that seek to maximize sample width.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Annals of Computer Science
سال: 2023
ISSN: ['1843-8121', '2248-2695']
DOI: https://doi.org/10.7561/sacs.2023.1.53